Optimizing Communication by Compression for Multi-GPU Scalable Breadth-First Searches
نویسنده
چکیده
The Breadth First Search (BFS) algorithm is the foundation and building block of many higher graph-based operations such as spanning trees, shortest paths and betweenness centrality. The importance of this algorithm increases each day due to it is a key requirement for many data structures which are becoming popular nowadays. When the BFS algorithm is parallelized by distributing the graph between several processors the interconnection network limits the performance. Hence, improvements on this area may benefit the overall performance of the algorithm. This work presents an alternative compression scheme for communications in distributed BFS processing. It focuses on BFS processors using General-Purpose Graphics Processing Units.
منابع مشابه
Scalable Breadth-First Search on a GPU Cluster
On a GPU cluster, the ratio of high computing power to communication bandwidth makes scaling breadthfirst search (BFS) on a scale-free graph extremely challenging. By separating high and low out-degree vertices, we present an implementation with scalable computation and a model for scalable communication for BFS and direction-optimized BFS. Our communication model uses global reduction for high...
متن کاملA Parallel Approach to Compression and Decompression of Triangle Meshes using the GPU
Most state-of-the-art compression algorithms use complex connectivity traversal and prediction schemes, which are not efficient enough for online compression of large meshes. In this paper we propose a scalable massively parallel approach for compression and decompression of large triangle meshes using the GPU. Our method traverses the input mesh in a parallel breadth-first manner and encodes t...
متن کاملCommunication Optimization for Multi GPU Implementation of Smith-Waterman Algorithm
GPU parallelism for real applications can achieve enormous performance gain. CPU-GPU Communication is one of the major bottlenecks that limit this performance gain. Among several libraries developed so far to optimize this communication, DyManD (Dynamically Managed Data) provides better communication optimization strategies and achieves better performance on a single GPU. SmithWaterman is a wel...
متن کاملCompression and Sieve: Reducing Communication in Parallel Breadth First Search on Distributed Memory Systems
For parallel breadth first search (BFS) algorithm on large-scale distributed memory systems, communication often costs significantly more than arithmetic and limits the scalability of the algorithm. In this paper we sufficiently reduce the communication cost in distributed BFS by compressing and sieving the messages. First, we leverage a bitmap compression algorithm to reduce the size of messag...
متن کاملA Research on Particle-Based Parallel Methods for Fluid Animation
In this paper, we present an acceleration strategy for Smoothed Particle Hydrodynamics (SPH) on multi-GPU platform. For single-GPU, we first use a neighborhood search algorithm of compacting cell index combined with spatial domain characteristics. For multi-GPU, we focus on the changing patterns of SPH's computational time. Simple dynamic load balancing algorithm works well because the computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1704.00513 شماره
صفحات -
تاریخ انتشار 2017